Exponentiation and Euler Measure
نویسنده
چکیده
Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with n elements (which can be done in 2 n ways), and the notion of choosing a k-element subset of a set with n elements (which can be done in n k ways). In this article I sketch the beginnings of a theory that would import these notions into the category of hedral sets in the sense of Morelli and the category of polyhedral sets in the sense of Schanuel. Both of these theories can be viewed as extensions of the theory of finite sets and mappings between finite sets, with the concept of cardinal-ity being replaced by the more general notion of Euler measure (sometimes called combinatorial Euler characteristic). I prove a " functoriality " theorem (Theorem 1) for subset-selection in the context of polyhedral sets, which provides quasi-combinatorial interpretations of assertions such as 2 −1 = 1 2 and 1/2 2 = − 1 8. Furthermore, the operation of forming a power set can be viewed as a special case of the operation of forming the set of all mappings from one set to another; I conclude the article with a polyhedral analogue of the set of all mappings between two finite sets, and a restrictive but suggestive result (Theorem 2) that offers a hint of what a general theory of exponentiation in the polyhedral category might look like. (Other glimpses into the theory may be found in [Pro].)
منابع مشابه
Matrix Inversion Is As Easy As Exponentiation
Abstract. We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [6], we establish an equivalence between matrix inversion and exponentiation up to polylogarithmic factors. In particular, this connection justifies the use of Laplacian solvers for designing fast semi-definite pr...
متن کاملMatrix Exponentiation and the Frank-Kamenetskii Equation
Long time solutions to the Frank-Kamenetskii partial differential equation modelling a thermal explosion in a vessel are obtained using matrix exponentiation. Spatial derivatives are approximated by high-order finite difference approximations. A forward difference approximation to the time derivative leads to a Lawson-Euler scheme. Computations performed with a BDF approximation to the time der...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملHarmonic analysis on spheres, II
1. A doomed-but-plausible trial calculation 2. Matrix exponentiation 3. Rotation-invariant derivatives on R 4. Instrinsic derivatives 5. Aside: GLn(R)-invariance of the Euler operator 6. ∑ i<j X 2 ij in coordinates on R 7. X` commutes with ∑ i<j X 2 ij 8. Stabilization of Hd by Xγ 9. Integration by parts for Xγ 10. Sup norms of derivatives of harmonic polynomials 11. Termwise differentiation of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001